A congruence theorem for structured operational semantics with predicates
ثبت نشده
چکیده
We proposed a syntactical format the path format for structured operational semantics in which predicates may occur We proved that strong bisim ulation is a congruence for all the operators that can be de ned within the path for mat To show that this format is useful we provided many examples that we took from the literature about CCS CSP and ACP they do satisfy the path format but no formats proposed by others The examples include concepts like termination convergence divergence weak bisimulation a zero object side conditions func tions real time discrete time sequencing negative premises negative conclusions and priorities or a combination of these notions
منابع مشابه
A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises
We proposed a syntactic format, the panth format, for structured operational semantics in which besides ordinary transitions also predicates, negated predicates, and negat.ed transitions may occur such that if the rules are stratifiable strong bisimulation equivalence is a cOllgruence for all the operators that can be defined within the panik format.. To show that this format is useful we took ...
متن کاملA Congruence Theorem for Structured Operational Semantics with Predicates
We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisim-ulation is a congruence for all the operators that can be deened within the path format. To show that this format is useful we provided many examples that we took from the literature about CCS, CSP, and ACP; they do satisfy the path format but no for...
متن کاملA congruence theorem for structured operational semantics with predicates
We proposed a syntactical format the path format for structured operational semantics in which predicates may occur We proved that strong bisim ulation is a congruence for all the operators that can be de ned within the path for mat To show that this format is useful we provided many examples that we took from the literature about CCS CSP and ACP they do satisfy the path format but no formats p...
متن کاملRooted Branching Bisimulation as a Congruence
This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements of Groote's ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises.
متن کاملA Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
In this paper we describe the promoted tyft/tyxt rule format for deening higher-order languages. The rule format is a generalization of Groote and Vaan-drager's tyft/tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisim-ulation is a congruence for any language deened in promoted tyft/tyxt format and demonstrate the usefulness of the rule format by present...
متن کامل